Bruhat canonical form for linear systems

Computation of a canonical form for linear differential-algebraic equations

This paper describes how a commonly used canonical form for linear differential-algebraic equations can be computed using numerical software from the linear algebra package LAPACK. This makes it possible to automate for example observer construction and parameter estimation in linear models generated by a modeling language like Modelica.

Approximating solution of fully fuzzy linear systems in dual form

A semi-canonical form for a class of right-invertible linear systems

Abstrati-We present a semi-canonical form for a class of right invertible systems under the action of the transformation group (T, F, G. II), where II is a permutation matrix acting on the outputs. Under certain additional conditions, this form is canonical. in particular when the system is nonsingular and controllable. 0 1997 Elsevier Science Ltd. All rights reserved. 1. Introduction The solut...

Descent Systems for Bruhat Posets

Let (W,S) be a finite Weyl group and let w ∈ W . It is widely appreciated that the descent set D(w) = {s ∈ S | l(ws) < l(w)} determines a very large and important chapter in the study of Coxeter groups. In this paper we generalize some of those results to the situation of the Bruhat poset W J where J ⊂ S. Our main results here include the identification of a certain subset S ⊂ W J that convinci...

Determining the order of minimal realization of descriptor systems without use of the Weierstrass canonical form

A common method to determine the order of minimal realization of a continuous linear time invariant descriptor system is to decompose it into slow and fast subsystems using the Weierstrass canonical form. The Weierstrass decomposition should be avoided because it is generally an ill-conditioned problem that requires many complex calculations especially for high-dimensional systems. The present ...